0.08/0.12 % Problem : SLH247^1 : TPTP v7.5.0. Released v7.5.0. 0.08/0.14 % Command : run_E %s %d THM 0.14/0.34 % Computer : n015.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 30 0.14/0.35 % WCLimit : 30 0.14/0.35 % DateTime : Tue Aug 9 02:50:56 EDT 2022 0.14/0.35 % CPUTime : 0.20/0.48 The problem SPC is TH0_THM_EQU_NAR 0.20/0.48 Running higher-order on 1 cores theorem proving 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.49 # Version: 3.0pre003-ho 0.35/0.65 # Preprocessing class: HSLSSMSSSSSNHSA. 0.35/0.65 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.35/0.65 # Starting full_lambda_9 with 30s (1) cores 0.35/0.65 # full_lambda_9 with pid 14870 completed with status 0 0.35/0.65 # Result found by full_lambda_9 0.35/0.65 # Preprocessing class: HSLSSMSSSSSNHSA. 0.35/0.65 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.35/0.65 # Starting full_lambda_9 with 30s (1) cores 0.35/0.65 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.35/0.65 # ...ProofStateSinE()=289/364 0.35/0.65 # Search class: HGHSM-FSLM33-DHSFFFBN 0.35/0.65 # partial match(1): HGHSM-FSLM31-DHSFFFBN 0.35/0.65 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 0.35/0.65 # Starting sh1l with 9s (1) cores 0.35/0.65 # sh1l with pid 14878 completed with status 0 0.35/0.65 # Result found by sh1l 0.35/0.65 # Preprocessing class: HSLSSMSSSSSNHSA. 0.35/0.65 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.35/0.65 # Starting full_lambda_9 with 30s (1) cores 0.35/0.65 # SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true) 0.35/0.65 # ...ProofStateSinE()=289/364 0.35/0.65 # Search class: HGHSM-FSLM33-DHSFFFBN 0.35/0.65 # partial match(1): HGHSM-FSLM31-DHSFFFBN 0.35/0.65 # Scheduled 6 strats onto 1 cores with 30 seconds (30 total) 0.35/0.65 # Starting sh1l with 9s (1) cores 0.35/0.65 # Preprocessing time : 0.013 s 0.35/0.65 0.35/0.65 # Proof found! 0.35/0.65 # SZS status Theorem 0.35/0.65 # SZS output start CNFRefutation 0.35/0.65 thf(decl_22, type, binary717961607le_T_a: binary1439146945Tree_a > a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_23, type, binary476621312_Tip_a: binary1439146945Tree_a). 0.35/0.65 thf(decl_24, type, binary256242811Tree_a: binary1439146945Tree_a > set_a). 0.35/0.65 thf(decl_25, type, binary1226383794sert_a: (a > int) > a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_26, type, binary504661350_eqs_a: (a > int) > a > set_a). 0.35/0.65 thf(decl_27, type, binary2053421120memb_a: (a > int) > a > binary1439146945Tree_a > $o). 0.35/0.65 thf(decl_28, type, binary945792244etOf_a: binary1439146945Tree_a > set_a). 0.35/0.65 thf(decl_29, type, binary1721989714Tree_a: (a > int) > binary1439146945Tree_a > $o). 0.35/0.65 thf(decl_30, type, binary670562003pred_a: (a > int) > a > a > binary1439146945Tree_a > $o). 0.35/0.65 thf(decl_31, type, minus_minus_int: int > int > int). 0.35/0.65 thf(decl_32, type, minus_minus_set_a: set_a > set_a > set_a). 0.35/0.65 thf(decl_33, type, monoid_a_o: ((a > $o) > (a > $o) > a > $o) > (a > $o) > $o). 0.35/0.65 thf(decl_34, type, monoid_set_a: (set_a > set_a > set_a) > set_a > $o). 0.35/0.65 thf(decl_35, type, semila980155549tr_a_o: ((a > $o) > (a > $o) > a > $o) > (a > $o) > $o). 0.35/0.65 thf(decl_36, type, semila1409648192_set_a: (set_a > set_a > set_a) > set_a > $o). 0.35/0.65 thf(decl_37, type, sup_sup_a_o: (a > $o) > (a > $o) > a > $o). 0.35/0.65 thf(decl_38, type, sup_sup_int: int > int > int). 0.35/0.65 thf(decl_39, type, sup_sup_set_a: set_a > set_a > set_a). 0.35/0.65 thf(decl_40, type, bot_bot_a_o: a > $o). 0.35/0.65 thf(decl_41, type, bot_bot_o: $o). 0.35/0.65 thf(decl_42, type, bot_bot_set_a: set_a). 0.35/0.65 thf(decl_43, type, ord_less_a_o: (a > $o) > (a > $o) > $o). 0.35/0.65 thf(decl_44, type, ord_less_int: int > int > $o). 0.35/0.65 thf(decl_45, type, ord_less_set_a: set_a > set_a > $o). 0.35/0.65 thf(decl_46, type, ord_less_eq_int: int > int > $o). 0.35/0.65 thf(decl_47, type, ord_less_eq_set_a: set_a > set_a > $o). 0.35/0.65 thf(decl_48, type, collect_a: (a > $o) > set_a). 0.35/0.65 thf(decl_49, type, insert_a: a > set_a > set_a). 0.35/0.65 thf(decl_50, type, is_empty_a: set_a > $o). 0.35/0.65 thf(decl_51, type, is_singleton_a: set_a > $o). 0.35/0.65 thf(decl_52, type, pairwise_a: (a > a > $o) > set_a > $o). 0.35/0.65 thf(decl_53, type, remove_a: a > set_a > set_a). 0.35/0.65 thf(decl_54, type, the_elem_a: set_a > a). 0.35/0.65 thf(decl_55, type, member_a: a > set_a > $o). 0.35/0.65 thf(decl_56, type, e: a). 0.35/0.65 thf(decl_57, type, h: a > int). 0.35/0.65 thf(decl_58, type, t: binary1439146945Tree_a). 0.35/0.65 thf(decl_59, type, x: a). 0.35/0.65 thf(decl_60, type, esk1_3: set_a > set_a > (a > $o) > a). 0.35/0.65 thf(decl_61, type, esk2_3: set_a > set_a > (a > $o) > a). 0.35/0.65 thf(decl_62, type, esk3_3: set_a > set_a > (a > $o) > a). 0.35/0.65 thf(decl_63, type, esk4_3: set_a > set_a > (a > $o) > a). 0.35/0.65 thf(decl_64, type, esk5_3: set_a > set_a > (a > $o) > a). 0.35/0.65 thf(decl_65, type, esk6_3: set_a > set_a > (a > $o) > a). 0.35/0.65 thf(decl_66, type, esk7_2: a > set_a > set_a). 0.35/0.65 thf(decl_67, type, esk8_4: a > set_a > a > set_a > set_a). 0.35/0.65 thf(decl_68, type, esk9_2: a > set_a > set_a). 0.35/0.65 thf(decl_69, type, esk10_1: set_a > a). 0.35/0.65 thf(decl_70, type, esk11_1: set_a > a). 0.35/0.65 thf(decl_71, type, esk12_1: set_a > a). 0.35/0.65 thf(decl_72, type, esk13_2: set_a > set_a > a). 0.35/0.65 thf(decl_73, type, esk14_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a). 0.35/0.65 thf(decl_74, type, esk15_4: (a > int) > binary1439146945Tree_a > a > binary1439146945Tree_a > a). 0.35/0.65 thf(decl_75, type, esk16_2: set_a > set_a > a). 0.35/0.65 thf(decl_76, type, esk17_4: set_a > (int > set_a) > int > int > int). 0.35/0.65 thf(decl_77, type, esk18_4: set_a > (int > set_a) > int > int > int). 0.35/0.65 thf(decl_78, type, esk19_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_79, type, esk20_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_80, type, esk21_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_81, type, esk22_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_82, type, esk23_4: int > int > (int > set_a) > set_a > int). 0.35/0.65 thf(decl_83, type, esk24_4: int > int > (int > set_a) > set_a > int). 0.35/0.65 thf(decl_84, type, esk25_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_85, type, esk26_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_86, type, esk27_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_87, type, esk28_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_88, type, esk29_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_89, type, esk30_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_90, type, esk31_4: set_a > (int > set_a) > int > int > int). 0.35/0.65 thf(decl_91, type, esk32_4: set_a > (int > set_a) > int > int > int). 0.35/0.65 thf(decl_92, type, esk33_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_93, type, esk34_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_94, type, esk35_4: int > int > (int > set_a) > set_a > int). 0.35/0.65 thf(decl_95, type, esk36_4: int > int > (int > set_a) > set_a > int). 0.35/0.65 thf(decl_96, type, esk37_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_97, type, esk38_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_98, type, esk39_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_99, type, esk40_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_100, type, esk41_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_101, type, esk42_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_102, type, esk43_4: set_a > (int > set_a) > int > int > int). 0.35/0.65 thf(decl_103, type, esk44_4: set_a > (int > set_a) > int > int > int). 0.35/0.65 thf(decl_104, type, esk45_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_105, type, esk46_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_106, type, esk47_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_107, type, esk48_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_108, type, esk49_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_109, type, esk50_4: set_a > (set_a > set_a) > set_a > set_a > set_a). 0.35/0.65 thf(decl_110, type, esk51_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_111, type, esk52_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_112, type, esk53_4: int > int > (int > set_a) > set_a > int). 0.35/0.65 thf(decl_113, type, esk54_4: int > int > (int > set_a) > set_a > int). 0.35/0.65 thf(decl_114, type, esk55_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_115, type, esk56_4: set_a > set_a > (set_a > set_a) > set_a > set_a). 0.35/0.65 thf(decl_116, type, esk57_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_117, type, esk58_4: set_a > set_a > (set_a > int) > int > set_a). 0.35/0.65 thf(decl_118, type, esk59_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_119, type, esk60_4: int > (set_a > int) > set_a > set_a > set_a). 0.35/0.65 thf(decl_120, type, esk61_2: set_a > (a > a > $o) > a). 0.35/0.65 thf(decl_121, type, esk62_2: set_a > (a > a > $o) > a). 0.35/0.65 thf(decl_122, type, esk63_3: (a > a > $o) > a > set_a > a). 0.35/0.65 thf(decl_123, type, esk64_2: a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_124, type, esk65_2: a > binary1439146945Tree_a > a). 0.35/0.65 thf(decl_125, type, esk66_2: a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_126, type, esk67_2: a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_127, type, esk68_2: a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_128, type, esk69_2: a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_129, type, esk70_2: a > binary1439146945Tree_a > a). 0.35/0.65 thf(decl_130, type, esk71_2: a > binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_131, type, esk72_1: (binary1439146945Tree_a > $o) > binary1439146945Tree_a). 0.35/0.65 thf(decl_132, type, esk73_1: (binary1439146945Tree_a > $o) > a). 0.35/0.65 thf(decl_133, type, esk74_1: (binary1439146945Tree_a > $o) > binary1439146945Tree_a). 0.35/0.65 thf(decl_134, type, esk75_1: binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_135, type, esk76_1: binary1439146945Tree_a > a). 0.35/0.65 thf(decl_136, type, esk77_1: binary1439146945Tree_a > binary1439146945Tree_a). 0.35/0.65 thf(decl_137, type, esk78_4: int > (int > int) > int > int > int). 0.35/0.65 thf(decl_138, type, esk79_4: int > (int > int) > int > int > int). 0.35/0.65 thf(decl_139, type, esk80_4: int > int > (int > int) > int > int). 0.35/0.65 thf(decl_140, type, esk81_4: int > int > (int > int) > int > int). 0.35/0.65 thf(decl_141, type, esk82_4: int > (int > int) > int > int > int). 0.35/0.65 thf(decl_142, type, esk83_4: int > (int > int) > int > int > int). 0.35/0.65 thf(decl_143, type, esk84_4: int > int > (int > int) > int > int). 0.35/0.65 thf(decl_144, type, esk85_4: int > int > (int > int) > int > int). 0.35/0.65 thf(decl_145, type, esk86_1: int > int). 0.35/0.65 thf(decl_146, type, esk87_1: int > int). 0.35/0.65 thf(decl_147, type, esk88_1: (int > int > $o) > int). 0.35/0.65 thf(decl_148, type, esk89_1: (int > int > $o) > int). 0.35/0.65 thf(decl_149, type, esk90_1: (int > int > $o) > int). 0.35/0.65 thf(decl_150, type, esk91_1: (int > int > $o) > int). 0.35/0.65 thf(decl_151, type, esk92_1: (int > int > $o) > int). 0.35/0.65 thf(decl_152, type, esk93_4: int > (int > int) > int > int > int). 0.35/0.65 thf(decl_153, type, esk94_4: int > (int > int) > int > int > int). 0.35/0.65 thf(decl_154, type, esk95_4: int > int > (int > int) > int > int). 0.35/0.65 thf(decl_155, type, esk96_4: int > int > (int > int) > int > int). 0.35/0.65 thf(decl_156, type, esk97_1: (a > $o) > a). 0.35/0.65 thf(decl_157, type, esk98_1: (a > $o) > a). 0.35/0.65 thf(decl_158, type, esk99_1: (a > $o) > a). 0.35/0.65 thf(decl_159, type, esk100_2: (a > $o) > (a > $o) > a). 0.35/0.65 thf(decl_160, type, esk101_2: (a > $o) > (a > $o) > a). 0.35/0.65 thf(conj_0, conjecture, (~((binary1721989714Tree_a @ h @ t))|((binary1721989714Tree_a @ h @ (binary1226383794sert_a @ h @ x @ t))&((binary945792244etOf_a @ (binary1226383794sert_a @ h @ e @ t))=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ t) @ (binary504661350_eqs_a @ h @ e)) @ (insert_a @ e @ bot_bot_set_a))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)). 0.35/0.65 thf(fact_8_Un__insert__right, axiom, ![X6:set_a, X5:a, X7:set_a]:(((sup_sup_set_a @ X6 @ (insert_a @ X5 @ X7))=(insert_a @ X5 @ (sup_sup_set_a @ X6 @ X7)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_Un__insert__right)). 0.35/0.65 thf(fact_60_Un__empty__right, axiom, ![X6:set_a]:(((sup_sup_set_a @ X6 @ bot_bot_set_a)=(X6))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_60_Un__empty__right)). 0.35/0.65 thf(fact_1_binsert__sorted, axiom, ![X1:a > int, X2:binary1439146945Tree_a, X4:a]:(((binary1721989714Tree_a @ X1 @ X2)=>(binary1721989714Tree_a @ X1 @ (binary1226383794sert_a @ X1 @ X4 @ X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_1_binsert__sorted)). 0.35/0.65 thf(fact_0_binsert__set, axiom, ![X1:a > int, X2:binary1439146945Tree_a, X3:a]:(((binary1721989714Tree_a @ X1 @ X2)=>((binary945792244etOf_a @ (binary1226383794sert_a @ X1 @ X3 @ X2))=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ X2) @ (binary504661350_eqs_a @ X1 @ X3)) @ (insert_a @ X3 @ bot_bot_set_a))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0_binsert__set)). 0.35/0.65 thf(c_0_5, negated_conjecture, ~((~(binary1721989714Tree_a @ h @ t)|((binary1721989714Tree_a @ h @ (binary1226383794sert_a @ h @ x @ t))&((binary945792244etOf_a @ (binary1226383794sert_a @ h @ e @ t))=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ t) @ (binary504661350_eqs_a @ h @ e)) @ (insert_a @ e @ bot_bot_set_a)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.35/0.65 thf(c_0_6, negated_conjecture, ((binary1721989714Tree_a @ h @ t)&(~(binary1721989714Tree_a @ h @ (binary1226383794sert_a @ h @ x @ t))|((binary945792244etOf_a @ (binary1226383794sert_a @ h @ e @ t))!=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ t) @ (binary504661350_eqs_a @ h @ e)) @ (insert_a @ e @ bot_bot_set_a))))), inference(fof_nnf,[status(thm)],[c_0_5])). 0.35/0.65 thf(c_0_7, plain, ![X1301:set_a, X1302:a, X1303:set_a]:(((sup_sup_set_a @ X1301 @ (insert_a @ X1302 @ X1303))=(insert_a @ X1302 @ (sup_sup_set_a @ X1301 @ X1303)))), inference(variable_rename,[status(thm)],[fact_8_Un__insert__right])). 0.35/0.65 thf(c_0_8, plain, ![X1354:set_a]:(((sup_sup_set_a @ X1354 @ bot_bot_set_a)=(X1354))), inference(variable_rename,[status(thm)],[fact_60_Un__empty__right])). 0.35/0.65 thf(c_0_9, negated_conjecture, (~((binary1721989714Tree_a @ h @ (binary1226383794sert_a @ h @ x @ t)))|((binary945792244etOf_a @ (binary1226383794sert_a @ h @ e @ t))!=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ t) @ (binary504661350_eqs_a @ h @ e)) @ (insert_a @ e @ bot_bot_set_a)))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.35/0.65 thf(c_0_10, plain, ![X3:a, X6:set_a, X7:set_a]:(((sup_sup_set_a @ X6 @ (insert_a @ X3 @ X7))=(insert_a @ X3 @ (sup_sup_set_a @ X6 @ X7)))), inference(split_conjunct,[status(thm)],[c_0_7])). 0.35/0.65 thf(c_0_11, plain, ![X6:set_a]:(((sup_sup_set_a @ X6 @ bot_bot_set_a)=(X6))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.35/0.65 thf(c_0_12, plain, ![X1585:a > int, X1586:binary1439146945Tree_a, X1587:a]:((~(binary1721989714Tree_a @ X1585 @ X1586)|(binary1721989714Tree_a @ X1585 @ (binary1226383794sert_a @ X1585 @ X1587 @ X1586)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1_binsert__sorted])])). 0.35/0.65 thf(c_0_13, plain, ![X1567:a > int, X1568:binary1439146945Tree_a, X1569:a]:((~(binary1721989714Tree_a @ X1567 @ X1568)|((binary945792244etOf_a @ (binary1226383794sert_a @ X1567 @ X1569 @ X1568))=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ X1568) @ (binary504661350_eqs_a @ X1567 @ X1569)) @ (insert_a @ X1569 @ bot_bot_set_a))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_binsert__set])])). 0.35/0.65 thf(c_0_14, negated_conjecture, (((insert_a @ e @ (minus_minus_set_a @ (binary945792244etOf_a @ t) @ (binary504661350_eqs_a @ h @ e)))!=(binary945792244etOf_a @ (binary1226383794sert_a @ h @ e @ t)))|~((binary1721989714Tree_a @ h @ (binary1226383794sert_a @ h @ x @ t)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9, c_0_10]), c_0_11])). 0.35/0.65 thf(c_0_15, plain, ![X1:a > int, X3:a, X2:binary1439146945Tree_a]:(((binary1721989714Tree_a @ X1 @ (binary1226383794sert_a @ X1 @ X3 @ X2))|~((binary1721989714Tree_a @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_12])). 0.35/0.65 thf(c_0_16, negated_conjecture, (binary1721989714Tree_a @ h @ t), inference(split_conjunct,[status(thm)],[c_0_6])). 0.35/0.65 thf(c_0_17, plain, ![X1:a > int, X3:a, X2:binary1439146945Tree_a]:((((binary945792244etOf_a @ (binary1226383794sert_a @ X1 @ X3 @ X2))=(sup_sup_set_a @ (minus_minus_set_a @ (binary945792244etOf_a @ X2) @ (binary504661350_eqs_a @ X1 @ X3)) @ (insert_a @ X3 @ bot_bot_set_a)))|~((binary1721989714Tree_a @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_13])). 0.35/0.65 thf(c_0_18, negated_conjecture, ((insert_a @ e @ (minus_minus_set_a @ (binary945792244etOf_a @ t) @ (binary504661350_eqs_a @ h @ e)))!=(binary945792244etOf_a @ (binary1226383794sert_a @ h @ e @ t))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])])). 0.35/0.65 thf(c_0_19, plain, ![X1:a > int, X3:a, X2:binary1439146945Tree_a]:((((insert_a @ X3 @ (minus_minus_set_a @ (binary945792244etOf_a @ X2) @ (binary504661350_eqs_a @ X1 @ X3)))=(binary945792244etOf_a @ (binary1226383794sert_a @ X1 @ X3 @ X2)))|~((binary1721989714Tree_a @ X1 @ X2)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17, c_0_10]), c_0_11])). 0.35/0.65 thf(c_0_20, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_16])]), ['proof']). 0.35/0.65 # SZS output end CNFRefutation 0.35/0.65 # Parsed axioms : 364 0.35/0.65 # Removed by relevancy pruning/SinE : 75 0.35/0.65 # Initial clauses : 471 0.35/0.65 # Removed in clause preprocessing : 13 0.35/0.65 # Initial clauses in saturation : 458 0.35/0.65 # Processed clauses : 460 0.35/0.65 # ...of these trivial : 24 0.35/0.65 # ...subsumed : 133 0.35/0.65 # ...remaining for further processing : 303 0.35/0.65 # Other redundant clauses eliminated : 58 0.35/0.65 # Clauses deleted for lack of memory : 0 0.35/0.65 # Backward-subsumed : 2 0.35/0.65 # Backward-rewritten : 3 0.35/0.65 # Generated clauses : 2301 0.35/0.65 # ...of the previous two non-redundant : 1951 0.35/0.65 # ...aggressively subsumed : 0 0.35/0.65 # Contextual simplify-reflections : 7 0.35/0.65 # Paramodulations : 2065 0.35/0.65 # Factorizations : 2 0.35/0.65 # NegExts : 5 0.35/0.65 # Equation resolutions : 81 0.35/0.65 # Propositional unsat checks : 0 0.35/0.65 # Propositional check models : 0 0.35/0.65 # Propositional check unsatisfiable : 0 0.35/0.65 # Propositional clauses : 0 0.35/0.65 # Propositional clauses after purity: 0 0.35/0.65 # Propositional unsat core size : 0 0.35/0.65 # Propositional preprocessing time : 0.000 0.35/0.65 # Propositional encoding time : 0.000 0.35/0.65 # Propositional solver time : 0.000 0.35/0.65 # Success case prop preproc time : 0.000 0.35/0.65 # Success case prop encoding time : 0.000 0.35/0.65 # Success case prop solver time : 0.000 0.35/0.65 # Current number of processed clauses : 273 0.35/0.65 # Positive orientable unit clauses : 54 0.35/0.65 # Positive unorientable unit clauses: 2 0.35/0.65 # Negative unit clauses : 7 0.35/0.65 # Non-unit-clauses : 210 0.35/0.65 # Current number of unprocessed clauses: 1948 0.35/0.65 # ...number of literals in the above : 6651 0.35/0.65 # Current number of archived formulas : 0 0.35/0.65 # Current number of archived clauses : 5 0.35/0.65 # Clause-clause subsumption calls (NU) : 7575 0.35/0.65 # Rec. Clause-clause subsumption calls : 4218 0.35/0.65 # Non-unit clause-clause subsumptions : 134 0.35/0.65 # Unit Clause-clause subsumption calls : 28 0.35/0.65 # Rewrite failures with RHS unbound : 0 0.35/0.65 # BW rewrite match attempts : 40 0.35/0.65 # BW rewrite match successes : 21 0.35/0.65 # Condensation attempts : 0 0.35/0.65 # Condensation successes : 0 0.35/0.65 # Termbank termtop insertions : 146982 0.35/0.65 0.35/0.65 # ------------------------------------------------- 0.35/0.65 # User time : 0.146 s 0.35/0.65 # System time : 0.005 s 0.35/0.65 # Total time : 0.151 s 0.35/0.65 # Maximum resident set size: 4380 pages 0.35/0.65 0.35/0.65 # ------------------------------------------------- 0.35/0.65 # User time : 0.154 s 0.35/0.65 # System time : 0.010 s 0.35/0.65 # Total time : 0.165 s 0.35/0.65 # Maximum resident set size: 2376 pages 0.35/0.65 EOF